Approximating MAX-E3LIN is NP-Hard
نویسنده
چکیده
This lecture focuses on the MAX-E3LIN problem. We prove that approximating it is NP-hard by a reduction from LABEL-COVER. In the MAX-E3LIN problem, our input is a series of linear equations (mod 2) in n binary variables, each with three terms. Equivalently, one can think of this as ±1 variables and ternary products. The objective is to maximize the fraction of satisfied equations.
منابع مشابه
Inapproximability of Minimum Vertex Cover
Last time we examined a generic approach for inapproximability results based on the Unique Games Conjecture. Before, we had already shown that approximating MAX-3-LIN to within a constant factor larger than 12 is NP-hard. To do this we used a tweaked version of our dictatorship test that we came up with earlier in the semester. Last time we (re)proved that approximating MAX-3-LIN to within a co...
متن کاملAdvanced Approximation Algorithms ( CMU 15 - 854 B , Spring 2008 ) Lecture 22 : Hardness of Max - E 3 Lin April 3 , 2008
This lecture is beginning the proof of 1 − ǫ vs. 1/2 + ǫ hardness of Max-E3Lin. The basic idea is similar to previous reductions; reduce from Label-Cover using a gadget that creates 2 variables corresponding to the key vertices and 2 vertices corresponding to the label vertices, where they correspond in the usual way to {0, 1} and {0, 1}. We then want to select some subsets x, y, z of these str...
متن کاملApproximating Backbone in the Weighted Maximum Satisfiability Problem
The weighted Maximum Satisfiability problem (weighted MAX-SAT) is a NP-hard problem with numerous applications arising in artificial intelligence. As an efficient tool for heuristic design, the backbone has been applied to heuristics design for many NP-hard problems. In this paper, we investigated the computational complexity for retrieving the backbone in weighted MAX-SAT. We showed that it is...
متن کاملOn the Hardness of Approximating Some NP-optimization Problems Related to Minimum Linear Ordering Problem
We study hardness of approximating several minimaximal and maximinimal NP-optimization problems related to the minimum linear ordering problem (MINLOP). MINLOP is to find a minimum weight acyclic tournament in a given arc-weighted complete digraph. MINLOP is APX-hard but its unweighted version is polynomial time solvable. We prove that, MIN-MAX-SUBDAG problem, which is a generalization of MINLO...
متن کاملApproximating the spectral radius of sets of matrices in the max-algebra is NP-hard
The lower and average spectral radii measure the minimal and average growth rates, respectively, of long products of matrices taken from a finite set. The logarithm of the average spectral radius is traditionally called the Lyapunov exponent. When one forms these products in the maxalgebra, we obtain quantities that measure the performance of Discrete Event Systems. We show that approximating t...
متن کامل